Orienting planar graphs
نویسندگان
چکیده
منابع مشابه
Edge-Orienting on Split, Planar and Treelike Graphs
Let G(V, E) be an undirected connected graph, where each vertex v is associated with a positive cost C(v) and each edge e 5 (u, v) is associated with two positive weights, W(u! v) and W(v! u). We consider a new graph problem, called the edge-orientation problem (the EOP). The major issue is to assign each edge e 5 (u, v) an orientation, either from u to v, denoted as u! v, or from v to u, denot...
متن کاملOrienting Graphs to Optimize Reachability
It is well known that every 2-edge-connected graph can be oriented so that the resulting digraph is strongly connected. Here we study the problem of orienting a connected graph with cut edges in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y. After transforming this problem, we prove a key theorem about the transformed problem that allo...
متن کاملOn orienting graphs for connectivity: Projective planes and Halin graphs
Nash-Williams proved that the edges of a k-edge connected (undirected) graph can be oriented such that the resulting directed graph is ⌊ 2 ⌋-edge connected. A long-standing goal in the area is to obtain analogous results for other types of connectivity, such as node connectivity, element connectivity, and hypergraph edge connectivity. We focus on two special classes of graphs, namely, incidence...
متن کاملApproximation Algorithms for Orienting Mixed Graphs
Graph orientation is a fundamental problem in graph theory that has recently arisen in the study of signaling-regulatory pathways in protein networks. Given a graph and a list of ordered source-target vertex pairs, it calls for assigning directions to the edges of the graph so as to maximize the number of pairs that admit a directed source-to-target path. When the input graph is undirected, a s...
متن کاملPlanar Graphs as VPG-Graphs
A graph is Bk-VPG when it has an intersection representation by paths in a rectangular grid with at most k bends (turns). It is known that all planar graphs are B3-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are B2-VPG. We also show that the 4-connected planar graphs constitute a subclass of the intersection graphs of Z-shapes (i.e., a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1976
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90065-0